Consensus decision models for preferential voting with abstentions
نویسندگان
چکیده
منابع مشابه
Byzantine Preferential Voting
In the Byzantine agreement problem, n nodes with possibly different input values aim to reach agreement on a common value in the presence of t < n/3 Byzantine nodes which represent arbitrary failures in the system. This paper introduces a generalization of Byzantine agreement, where the input values of the nodes are preference rankings of three or more candidates. We show that consensus on pref...
متن کاملSecure e-Voting for Preferential Elections
Electronic voting (e-voting) systems can greatly enhance the efficiency, and potentially, the transparency of national elections. However, the security of such systems is an area of on-going research. The literature for secure e-voting is predominantly concerned with 1-out-of-m voting strategies, where m is the number of candidates running for the elections. This paper presents a case study of ...
متن کاملA continuous rating method for preferential voting
A method is given for quantitatively rating the social acceptance of different options which are the matter of a preferential vote. The proposed method is proved to satisfy certain desirable conditions, among which there is a majority principle, a property of clone consistency, and the continuity of the rates with respect to the data. One can view this method as a quantitative complement for a ...
متن کاملConsensus versus Dichotomous Voting
Consensus means general agreement among possibly di erent views, while dichotomus voting rules are a means of making decisions by using votes to settle di erences of view. How then can it often be the case that a committee whose only formal mechanism for decision-making is a dichotomus voting rule reaches a consensus? In this paper, based on a game-theoretic model developed in three previous pa...
متن کاملOnline Learning with Abstentions
We present an extensive study of the key problem of online learning where algorithms are allowed to abstain from making predictions. In the adversarial setting, we show how existing online algorithms and guarantees can be adapted to this problem. In the stochastic setting, we first point out a bias problem that limits the straightforward extension of algorithms such as UCB-N to time-varying fee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Industrial Engineering
سال: 2018
ISSN: 0360-8352
DOI: 10.1016/j.cie.2017.12.007